@InProceedings{MarianoSouzEndoVija:2019:AnGrAl,
               author = "Mariano, Matheus Monteiro and Souza, {\'E}rica F. and Endo, 
                         Andr{\'e} T. and Vijaykumar, Nandamudi Lankalapalli",
          affiliation = "{Instituto Nacional de Pesquisas Espaciais (INPE)} and 
                         {Universidade Tecnol{\'o}gica Federal do Paran{\'a} (UFTPR)} and 
                         {Universidade Tecnol{\'o}gica Federal do Paran{\'a} (UFTPR)} and 
                         {Instituto Nacional de Pesquisas Espaciais (INPE)}",
                title = "Analyzing graph-based algorithms employed to generate test cases 
                         from finite state machines",
            booktitle = "Proceedings...",
                 year = "2019",
         organization = "IEEE Latin American Test Symposium, 20. (LATS)",
            publisher = "IEEE",
             keywords = "—Software Testing, Model Based Testing, Finite State Machine, 
                         Graph-based algorithms.",
             abstract = "Context: Model-Based Testing (MBT) is a technique that employs 
                         formal models to represent reactive systems behavior and generates 
                         test cases. Such systems are mostly specified and verified using 
                         Finite State Machines (FSMs). There is a plethora of test 
                         generation algorithms in the literature. Most of them are 
                         graph-based once an FSM can be formally defined as a graph. 
                         Nevertheless, there is a lack of studies on analyzing cost and 
                         efficiency of FSM-based test generation algorithms. Objective: 
                         This study aims to compare graph-based algorithms employed to 
                         generate test cases from FSM models. In particular, we compare the 
                         Chinese Postman Problem (CPP) and H-Switch Cover (HSC) algorithms 
                         with the well-known depth-first and breadth-first searches 
                         algorithms in the context of covering all-transitions and 
                         all-transition-pairs criteria in an FSM. Method: First, a 
                         systematic literature mapping was conducted to summarize the 
                         algorithms that have been adopted in MBT, considering FSM. The 
                         main algorithms found were implemented and analyzed in different 
                         experiments. Results: CPP presented better results with the FSMs 
                         used in terms of number of test cases and test suite size. In 
                         addition, CPP also presented low distribution of average length 
                         compared to other algorithms.",
  conference-location = "Santiago, Chile",
      conference-year = "11-13 mar.",
                 isbn = "978-172811756-0",
             language = "en",
        urlaccessdate = "27 abr. 2024"
}